USPTO Patents Application 10720726

EAST Search History

Ref

#

Hits

Search Query

DBS

Default
uperator

Plurals

Time Stamp

SI

13

adam near wolff.in.

US-PGPUB;

1 ICDAT

UbrA 1

OR

ON

2007/06/12 14:51

S2

16

Oliver near steele.in.

US-PGPUB;
USPAT

OR

ON

2007/06/12 14:52

S3

16

david near temkin.in.

US-PGPUB;
USPAT

OR

ON

2007/06/12 14:54

S4

2

p near withington.in.

US-PGPUB;
USPAT

OR

ON

2007/06/12 15:03

S5

8

laszlo.as.

US-PGPUB;
USPAT

OR

ON

2007/06/12 15:14

S6

1887

717/151-161.ccls.

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:08

5/

21

S6 and senaltz$5 and run$ltime
and (virtual adj machine)

1 IC D^DI ID >

Ub-rCaHUo;

USPAT;

USOCR;

EPO; JPO;

DERWErfT;

IB|V|_TDB

UK

UIM

zou//ub/i2 ib:uy

S8

20

S7 and (@pd< 20031124 or
@ad<"20031124" or
@prad<"20031124" or
@rlad<"20031124")

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:55

S9

1

"5987256".pn.

US-PGPUB;
USPAT

OR

ON

2007/06/12 15:15

SIO

1939

serializ$5 near3 object

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:18

Sll

384

SIO and run$ltime and (virtual adj
machine)

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBiV|_TDB

OR

ON

2007/06/12 15:18

6/14/2007 10:33:16 AM

C:\Documents and Settings\qchen\l^y Documents\EAST\Workspaces\docket\10720726.wsp

Page 1

EAST Search History

512

293

Sll and compil$5

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

15:19

•

S13

198

S12 and reflect$4

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWEINTT;

IBM_TDB

OR

ON

2\j\j7l\jbll2 15:20

S14

198

S13 and Java

US-PGPUB;
USPAT;
USOCR;
EPO; JPO;
DERWENT;
IBM TDB

OR

ON

2\j\j7I\)qIiZ 15:20

S15

23

S14 and {(decreas$4 or lower$4 or
reduc$4) near time)

US-PGPUB;
USPAT;
USOCR; '
EPO; JPO;
DERWENT;
IBM_TDB

OR

ON

2007/06/12 15:29

S16

113

(serializ$5 near3 object) with
run$ltime

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:29

S17

96

S16 and compil$5

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM.TDB

OR

ON

2007/06/12 15:29

S18

73

S17 and (@pd< 20031124 or
@ad<"20031124" or
@prad<"20031124" or
@rlad<"20031124")

. US-PGPUB;
USPAT;
USOCR;
EPO; JPO;
DERWENT;
IBM_TDB

OR

ON

2007/06/12 15:30

S19

2347

seridliz$5 near3 (application or
object)

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:43

6/14/2007 10:33:16 AM

C:\Documents and Settings\qchen\My Documents\EAST\Workspaces\docket\10720726.wsp

Page 2

EAST Search History

S20

385

S19 and (virtual adj machine) and
compil$5

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM.TDB

OR

ON

2007/06/12 15:43

S21

210

S20 and xml

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:44

S22

8

S21 and (start$lup adj time)

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:52

S23

207

S21 and Java

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM.TDB

OR

ON

IQOllQSIll 15:52

S24

161

S23 and reflect$4

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM.TDB

OR

ON

imimm 15:53

S25

133

S24 and optimiz$5

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:55

S26

105

S25 and (@pd<"20031124" or
@ad<"20031124" or
@prad<"20031124" or
@rlad<"20031124")

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 15:55

S27

1431

(decreas$4 or iower$4 or reduc$4)
near3 (start$lup adj time)

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/12 16:08

6/14/2007 10:33:16 Al^

C:\Documents and Settings\qchen\l^y Documents\EAST\Worl<spaces\doclcet\10720726.wsp

Page 3

EAST Search History

528

4

527 and serjaljz$5 and compil$5
and (virtual adj machine)

1 IC D^DI ID •

Ub-rbrUb;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM.TDB

OK

UlM

ZUU//UO/1Z iD.Uo

S29

9

("20020099753" | "4912628" |
"5966540" 1 "6421739" | "6718538"
1 "6760815" 1 "6854115" |
"6934755" | "7093086").PN.

US-PGPUB;

USPAT;

USOCR

OR

ON

2007/06/12 16:12

S30

50

("20050114871" "6412106"
"6880129" "20070061779"
"5485600" "6230309" "6434447"
"20040172544" "20050160412"
"20050193380" "20070094609"
"5182806" "5193191" "5201050"
"5301327" "5313387" "5325531"
"5916308" "5369766" "5412806"
"5430836" "5459865" "5519862"
"5819090" "5873093" "5901313"
"5926631" "5974256" "6067639"
"6122641" "6189047" "6282702"
"6295643" "6324683" "6408403"
"6412021" "6446254" "6483911"

"AJ^717QQ" "AE^QdCIO" "Af;*57n'51"

"7039904" "7058934" "7155381"
"7228533" "20020138659"
"20020161996" "20020169591"
"20030033443" "20030079052" ).
pn.

US-PGPUB;
USPAT

*

OR

ON

2007/06/13 11:58

531

2

20040044989 .pn.

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWEI^;

IBM_TDB

OR

ON

IQQllOblYi 16:10

object nedr3 media

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWEI^;

IBM_TDB

OR

ON

2Q\j/l\joll6 17:27

COO

7

object adj (code or file) nearS
(media adj file)

1 If* r>^oi ID .

US-PGPUB;

USPAT;

USOCR;

EPO; JPO;

DERWENT;

IBM_TDB

OR

ON

2007/06/13 17:28

6/14/2007 10:33:16 AM

C:\Documents and Settings\qchen\My Documents\EAST\Workspaces\docket\10720726,wsp

Page 4

Results (page 1): serialization "start-up time"

Page 1 of 5

PcmxAL

USPTO

wm ami mmm^. mmm'&.

Subscribe (Full Service) Register (Limited Service, Free) Login

Search: ^ The ACM Digital Library C The Guide
jserlallzation "start-up time" [ i

—

g . I Feedback Report a problem Satisfaction

survey

Terms used serialization start up time Found 1 ,924 of 203,282

— Tf ^ Save results to a Binder Try an Advanced Search

—a fzy, Trv thiQ QP»arrh in Thp AC

Sort results
by
Display
results

relevance _^

1 ^ Search Ti ps

expanded form ^ r Open results in a new

window

Try this search in The ACM Guide

Results 1 - 20 of 200
Best 200 shown

Result page; 12345678910

next

Relevance scale □ Q H i

Migration: Optimizing the migration of virtual computers

^ Constantine P. Sapuntzakis, Ramesh Chandra, Ben Pfaff, Jim Chow, Monica S. Lam, Mendel

Rosenblum

December 2002 ACM SIGOPS Operating Systems Review, Volume 36 issue si
Publisher: ACM Press

Additional Information: full citation , abstract , references , cited b y. index
terms

Full text available: •g.pdf(168.M.B)

This paper shows how to quickly move the state of a running computer across a network,
including the state in its disks, memory, CPU registers, and I/O devices. We call this state
a capsule. Capsule state is hardware state, so it includes the entire operating system as
well as applications and running processes. We have chosen to move x86 computer states
because x86 computers are common, cheap, run the software we use, and have tools for
migration. Unfortunately, x86 c ...

Searcliinq for the sorting record: experiences in tuning NOW-Sort

Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, David E. Culler, Joseph M. Hellerstein,

David A. Patterson

August 1998 Proceedings of the SIGMETRICS symposium on Parallel and distributed
tools SPDT -98

Publisher: ACM Press

Full text available: 'Q pdfn.37 MB ) Additional Information: full citation , references , citings , index terms

3 Fast volume rendering using an efficient, scalable parallel formulation of the shear-
^ war p algorithm

^ MInesh B. Amin, Ananth Grama, VIneet Singh

December 1995 Proceedings of the IEEE symposium on Parallel rendering PRS '95

Publisher: ACM Press

Full text available: ^ pdf(1.19 MB) Additional Information: full citation , citing s, index terms

Keywords: adaptive load-balancing, performance modeling and analysis, raytracing,
scalability, shear-warp algorithm, volume rendering

Cautious transaction schedulers with admission control
Naoki Katoh, Toshihide Ibaraki, TIko Kameda

June 1985 ACM Transactions on Database Systems (TODS), volume lo issue 2

http://portal.acm.org/results.cfm?query=serialization%20%22start%2Dup%20time%22&query 6/14/2007

Results (page 1): serialization "start-up time"

Page 2 of 5

Publisher: ACM Press

Additional Information: full citation , abstract , references , citings , index

Full text available: mpdfn.92MB)

i^^^y^^ terms

We propose a new class of schedulers, called cautious schedulers, that grant an input
request if it will not necessitate any rollback in the future. In particular, we investigate
cautious WRW-schedulers that output schedules in class WRW only. Class WRW consists
of all schedules that are serializable, while preserving the write-read and read -write
conflict, and is the largest polynomially recognizable subclass of serializable schedules
currently known. It i ...

5 Consistency of transactions and random batch B
Rudolf Bayer

December 1986 ACM Transactions on Database Systems (TODS), Volume ii issue 4
Publisher: ACM Press

Full text available: mpdf(597J2KB) A^^"'^"^' Information: full citation, abstract, references , citings, index

j^^;j_r^x terms

A synchronization technique and scheduling strategy is described, which allows us to run
a batch process simultaneously with on-line transactions. The batch process and the
transactions are serialized in such a way that consistency level 3 Is achieved.

Libraries and applications: Locality aware dynamic load management for massively Q
multiplayer games

Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutsson, Honghui Lu, Cristiana Amza
June 2005 Proceedings of the tenth ACM SIGPLAN symposium on Principles and
practice of parallel programming PPoPP '05

Publisher: ACM Press

Full text available* Wi df( 245 56 KB) Additional Information: full citation , abstract , references , citings , index
^ terms

Most massively multiplayer game servers employ static partitioning of their game world
into distinct mini-worlds. that are hosted on separate servers. This limits cross-server
interactions between players, and exposes the division of the world to players. We have
designed and implemented an architecture in which the partitioning of game regions
across servers is transparent to players and interactions are not limited to objects in a
single region or server. This allows a finer grain partitioning, ...

Keywords: adaptive, distributed, load balancing, locality aware, massively multiplayer
games

Representation of function variants for embedded system optimization and synthesis ||||
K. Richter, D, Ziegenbein, R. Ernst, L Thiele, J. Teich

June 1999 Proceedings of the 36th ACM/IEEE conference on Design automation DAC
'99

Publisher: ACM Press

Full text available: fi! lpdf(1 53.80 KB) Additional Information: full citation , references , citings , index terms

Compiler-directed page coloring for multiprocessors Q
Edouard Bugnion, Jennifer M. Anderson, Todd C. Mowry, Mendel Rosenblum, Monica S. Lam
September 1996 ACM SIGPLAN Notices , ACM SIGOPS Operating Systems Review ,

Proceedings of the seventli international conference on Architectural
support for programm ing languages and operating systems ASPLOS-
VII, Volume 31 ; 30 Issue 9,5
Publisher: ACM Press

Additional Information: full citation , abstract , references , citings , index

Full text available: -— .

^ terms

This paper presents a new technique, compiler-directed page coloring, that eliminates

http://portal.acm.org/resultsxfm?query=serialization%20%22start%2Dup%20time%22& 6/14/2007

Results (page 1): serialization "start-up time" Page 3 of 5

conflict misses in nnultiprocessor applications. It enables applications to make better use
of the Increased aggregate cache size available in a multiprocessor. This technique uses
' the compiler's knowledge of the access patterns of the parallelized applications to direct

the operating system's virtual memory page mapping strategy. We demonstrate that this
technique can lead to significant performance impr ...

9 TO-Lock: Removing Lock Overhead Using the Owners' Temporal Locality Q
Takeshi Ogasawara, HideakI Komatsu, Toshio Nakatani

September 2004 Proceedings of the 13th International Conference on Parallel
Architectures and Compilation Techniques PACT '04

Publisher: IEEE Computer Society

Full text available: 'glpdf(235.12 KB) Additional Information: full citation , abstract

The performance of locking is critical, as programming languages with built-in thread
support are coming into wide use. Many techniques for optimizing Java monitors have
been proposed, based on the observation that the locks are rarely contended for in many
applications. However, the problem of the performance degradation in SMP environments
caused by necessary serializations of the processors' execution has not been addressed
for shared objects. We propose a new algorithm for this problem. It u ...

10 Synchronization and recovery in a client-server storage system Q
E. Panagos, A. Biliris

August 1997 The VLDB Journal — The International Journal on Very Large Data

Bases, volume 6 Issue 3
Publisher: Springer-Verlag New York, Inc.

Full text available: ^ pdf(205.25 KB) Additional Information: full citation , abstract , citings, index terms

Client-server object-oriented database management systems differ significantly from
traditional centralized systems in terms of their architecture and the applications they
target. In this paper, we present the client-server architecture of the EOS storage
manager and we describe the concurrency control and recovery mechanisms it employs.
EOS offers a semi-optimistic locking scheme based on the multi-granularity two-version
two-phase locking protocol. Under this scheme, multiple concurrent reade ...

Keywords: Checkpoint, Client-server architecture. Object management. Concurrency
control. Locking, Logging, Recovery, Transaction management

11 CARAT: a testbed for th e performan ce evaluation of distributed database systems Q

Walt Kohler, Bao-Chyuan Jenq

November 1986 Proceedings of 1986 ACM Fall joint computer conference ACM '86
Publisher: IEEE Computer Society Press

Full text available: ^ pdfn.21 MB) Additional Information: full citation , references , citings , index terms

''2 Design and implementation of a distributed virtual machine for networked computers
Ennin Gun Sirer, Robert Grimnr), Arthur J. Gregory, Brian N. Bershad
December 1999 ACM SIGOPS Operating Systems Review , Proceedings of the

seventeenth ACM symposium on Operating systems principles SOSP
'99, Volume 33 Issue 5
Publisher: ACM Press

I- II X * -I ui 01 ^fi^ KAD\ Additional Information: full citation , abstract , references , citings, index

Full text available: Tq pdf(1.62 MB)

terms

This paper describes the motivation, architecture and performance of a distributed virtual
machine (DVM) for networked computers. DVMs rely on a distributed service architecture
to meet the manageability, security and uniformity requirements of large, heterogeneous
clusters of networked computers. In a DVM, system services, such, as verification, security
enforcement, compilation and optimization, are factored out of clients and located on
powerful network servers. This partitioning of system fun ...

http://portal.acm.org/resultsxfm?query=serialization%20%22start%2Dup%20time%22&quety 6/14/2007

Results (page 1): serialization "start-up time"

Page 4 of 5

13 A highly available scalable ITV system Q
^ M. N. Nelson, M. Linton, S. Owicki

December 1995 ACM SIGOPS Operating Systems Review , Proceedings of the fifteenth

ACM symposium on Operating systems principles SOSP '95, volume 29

Issue 5

Publisher: ACM Press

Full text available: ^ pdf(1.64MB) Additional Information: full citation , references , citings, index terms

14 O ptimizin g threaded MPI execution on SMP_clustej:s
Hong Tang, Tao Yang

June 2001 Proceedings of the 15th International conference on Supercomputing ICS
'01

Publisher: ACM Press

Full text available* 113 Ddf(273 33 KB) Information: full citation , abstract , references , citing s, index

'^^'"^ ' terms

Our previous work has shown that using threads to execute MPI programs can yield great
performance gain on multiprogrammed shared-memory machines. This paper investigates
the design and implementation of a thread-based MPI system on SMP clusters. Our study
indicates that with a proper design for threaded MPI execution, both point-to-point and
collective communication performance can be improved substantially, compared to a
process-based MPI implementation in a cluster environment. Our contrib ...

Keywords: MPI, SMP clusters, communication optimization, multi-threading

'•s Performance management of mobile agient systems
Omer F. Rana

June 2000 Proceedings of the fourth international conference on Autonomous agents
AGENTS '00

Publisher: ACM Press

Full text available: Q pdf(856.21 KB ) Additional Information: full citation , references , citings, index terms

''6 Iteration space slicin g and its applic ation to communication optimization
William Pugh, Evan Rosser

July 1997 Proceedings of the 11th international conference on Supercomputing ICS
'97

Publisher: ACM Press

Full text available: ^ pdf(1.67 MB) Additional Information: full citation , references , citings , index terms

Keywords: communication optimization, latency tolerance, message coalescing, program
slicing.

17 A tour on the TriGS active database system — architectue and implementation Q
Gerti Kappel, Stefan Rausch-Schott, Werner Retschitzegger

February 1998 Proceedings of the 1998 ACM symposium on Applied Computing SAC
•98

Publisher: ACM Press

Full text available: ^ pdf(955.78 KB) Additional Information: full citation , references , index terms

Keywords: EGA rules, active object-oriented database systems, composite events,

http://portal.acm.org/results.cfm?query=serialization%20%22start%2Dup%20time%22&quer^ 6/14/2007

Results (page 1): serialization "start-up time" Page 5 of 5

optimization, parallel rule scheduling and processing

18 Partial behavioral reflection: spatial and tennporal selection of reification Q
EricTanter, Jacques Noye, Denis Caromel, Pierre Cointe

October 2003 ACM SIGPLAN Notices , Proceedings of tlie 18th annual ACM SIGPLAN
conference on Object-oriented programing, systems, languages, and
applications OOPSLA '03, Volume 38 Issue 11
Publisher: ACM Press

I- II* * I ui 0t ^f/^dAAAUTD^ Additional Information: full citation , abstract , references , citings , index
Full text available: TO pdf(261 .44 KB) • — ^

Behavioral reflection is a powerful approach for adapting the behavior of running
applications. In this paper we present and motivate partial behavioral reflection, an
approach to more efficient and flexible behavioral reflection. We expose the spatial and
temporal dimensions of such reflection, and propose a model of partial behavioral
reflection based on the notion of hooksets. In the context of Java, we describe a reflective
architecture offering appropriate interf ...

Keywords: aspect-oriented programming, open systems, reflection

1^ Desi g n and implementation of generics for the .NET Common lan g uage runtime Q
Andrew Kennedy, Don Syme

May 2001 ACM SIGPLAN Notices , Proceedings of the ACM SIGPLAN 2001 conference
on Programming language design and implementation PLDI '01, volume 36
Issue 5
Publisher: ACM Press

Full text available* f**! odfd 25 MB) Additional Information: full citation , abstract , references , citings , index

terms

The Microsoft.NET Common Language Runtime provides a shared type system,
intermediate language and dynamic execution environment for the implementation and
inter-operation of multiple source languages. In this paper we extend it with direct
support for parametric polymorphism (also known as generics), describing the design
through examples written in an extended version of the C# programming language, and
explaining aspects of implementation by reference to a prototype extension to the
runtim ...

20 MPI and Java-MPI: contrasts a nd com parisons of low-level communication Q
performance

Vladimir Getov, Paul Gray, Vaidy Sunderam

January 1999 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
(CDROM) Supercomputing '99

Publisher: ACM Press

Full text available: ^pdf(96.21 KB) Additional Information: full citation , references , citings , index terms

Results 1 - 20 of 200 Result page: 1 2345678910 next

The ACM Portal.is published by the Association for Computing Machinery. Copyright © 2007 ACM, Inc.
Terms of Us age Privacy Policy Code of Ethics Contact Us

Useful downloads: Adobe Acrobat QuickTime S Windows Media Player " v Real Play er

http://portaI.acm.org/resultsxfm?query=serialization%20%22start%2Dup%20time%22&querydisp=serial... 6/14/2007